A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling
نویسندگان
چکیده
منابع مشابه
Scheduling a constellation of agile earth observation satellites with preemption
In this paper, we consider a scheduling problem for a set of agile Earth observation satellites for scanning different parts of the Earth’s surface. We assume that preemption is allowed to prevent repetitive images and develop four different preemption policies. Scheduling is done for the imaging time window and transmission time domain to the Earth stations as well. The value of each picture ...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA Branch-and-bound Algorithm for Parallel Machine Scheduling Problems
In this paper, a Branch-and-Bound (B&B) algorithm is presented to solve the problem of minimizing the maximum completion time Cmax on unrelated parallel machines with machine eligibility restrictions when job preemption is not allowed. A customized lower bound, a search and a branching strategy are developed for the B&B. A machine eligibility factor is also introduced to represent the percentag...
متن کاملPlanning for Agile Earth Observation Satellites
Agile Earth observation satellites are satellites orbiting Earth with the purpose to gather information of the Earth’s surface by slewing the satellite toward regions of interest. Constraints arise not only from dynamical and kinematic aspects of the satellite and its sensors. Regions of interest change over time and bad weather can conceal important observation targets. This results in a const...
متن کاملA "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
The daily photograph scheduling problem of earth observation satellites like Spot 5 consists in scheduling a subset of mono or stereo photographs from a set of candidates to different cameras. The scheduling must optimize a cost function while satisfying a large number of constraints. In this paper, we first present a formulation of the problem as a generalized version of the well-known knapsac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2017
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2017/7345941